Transforming Ordered Constraint Hierarchies into Ordinary Constraint Systems
نویسنده
چکیده
In this paper, we propose ordered constraint hierarchies and a non-trivial error function to model and solve over-constrained real-world problems adequatly. We substantiate our proposition by an example. Then we present a new method to transform constraint hierarchies into equivalent ordinary constraint systems. For practial applications, we present a modiied algorithm based on an incomplete nite domain constraint solver. We conclude with a prototype implementation of the method and some aspects about our future work.
منابع مشابه
Solving Hierarchies of Finite-domain Constraints 1 2
In the past we presented an algorithm to solve ordered constraint hierarchies based on a non-trivial error function using standard constraint satisfaction techniques. We extended this previous work and herewith present a new method to transform hierarchies of inequalities over the integers based on global comparators into equivalent ordered constraint hierarchies. The correctness of this method...
متن کاملIntegration of Ordered Constraint Hierarchies Based on a Non-Trivial Error Function in CLP(FD)
In this paper, we propose ordered constraint hierarchies and a non-trivial error function to model and solve over-constrained real-world problems adequately. We present an algorithm to atten constraint hierarchies consisting of polynomial equations and in-equations. The algorithm is based on an incomplete nite domain constraint solver. We conclude with some implementation details, some examples...
متن کاملA Generalized Algorithm for Solving Constraint Hierarchies1
Constraint hierarchies have been proposed to overcome over-constrained systems of constraints by specifying constraints with hierarchical preferences. They are widely used in HCLP (Hierarchical Constraint Logic Programming), CIP (Constraint Imperative Programming) and graphical user interfaces. The advantages of constraint hierarchies are a declarative expression of preferred constraints and th...
متن کاملSolving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-based constraint satisfaction problems (SCSPs), we define constraint hierarchy k-consistency (CH-k-C) and give a CH-2-C enforcement algorithm. We demonstrate how the CH-2-C algorithm can be seamlessly integrated into the...
متن کاملA Plug-In Architecture of Constraint Hierarchy Solvers1
Constraint hierarchies have been proposed to overcome over-constrained systems of constraints by specifying constraints with hierarchical preferences. They are widely used in HCLP (Hierarchical Constraint Logic Programming) – an extension of CLP (Constraint Logic Programming) to include constraint hierarchies, CIP (Constraint Imperative Programming) – an integration of declarative constraint pr...
متن کامل